A Dialogue with Yuri Gurevich about Mathematics , Computer Science and Life ∗
نویسندگان
چکیده
Yuri Gurevich is well-known to the readers of this Bulletin. He is a Principal Researcher at Microsoft Research, where he founded a group on Foundations of Software Engineering, and a Professor Emeritus at the University of Michigan. His name is most closely associated with abstract state machines but he is known also for his work in logic, complexity theory and software engineering. The Gurevich-Harrington Forgetful Determinacy Theorem is a classical result in game theory. Yuri Gurevich is an ACM Fellow, a Guggenheim Fellow, and a member of Academia Europaea; he obtained honorary doctorates from Hasselt University in Belgium and Ural State University in Russia.
منابع مشابه
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoidable that Gurevich made some great contributions to database theory. We discuss some of these contributions, and, along the way, present some personal anecdotes connected to Yuri and the author. We also describe the h...
متن کاملSome Undecidable Problems Related to the Herbrand Theorem
March 1997 (revised July 1997) ISSN 1100{0686 Some Undecidable Problems Related to the Herbrand Theorem Yuri Gurevich Margus Veanes EECS Department Computing Science Department University of Michigan Uppsala University Ann Arbor, MI 48109-2122 Box 311, S-751 05 Uppsala USA Sweden [email protected] [email protected] Abstract We improve upon a number of recent undecidability results related to th...
متن کاملTHE LOGIC IN COMPUTER SCIENCE COLUMN by Yuri GUREVICH Algorithms vs. Machines
Yiannis Moschovakis argues that some algorithms, and in particular the mergesort algorithm, cannot be adequately described in terms of machines acting on states. We show how to describe the mergesort algorithm, on its natural level of abstraction, in terms of distributed abstract state machines.
متن کاملTHE LOGIC IN COMPUTER SCIENCE COLUMN by Yuri GUREVICH Pairwise Testing
We discuss the following problem, which arises in software testing. Given some independent parameters (of a program to be tested), each having a certain nite set of possible values, we intend to test the program by running it several times. For each test, we give the parameters some (intelligently chosen) values. We want to ensure that for each pair of distinct parameters, every pair of possibl...
متن کاملTHE LOGIC IN COMPUTER SCIENCE COLUMN 1 by Yuri GUREVICH
The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine [Gurevich 1985, 1991]. Abstract state machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The early applications were driven, at least partially, by the desire to test...
متن کامل